A Quadratically Convergent Algorithm for Structured Low-Rank Approximation
نویسندگان
چکیده
منابع مشابه
A Quadratically Convergent Algorithm for Structured Low-Rank Approximation
Structured Low-Rank Approximation is a problem arising in a wide range of applications in Numerical Analysis and Engineering Sciences. Given an input matrix M , the goal is to compute a matrix M ′ of given rank r in a linear or affine subspace E of matrices (usually encoding a specific structure) such that the Frobenius distance ‖M −M ′‖ is small. We propose a Newton-like iteration for solving ...
متن کاملStructured Low Rank Approximation
Abstract. This paper concerns the construction of a structured low rank matrix that is nearest to a given matrix. The notion of structured low rank approximation arises in various applications, ranging from signal enhancement to protein folding to computer algebra, where the empirical data collected in a matrix do not maintain either the specified structure or the desirable rank as is expected ...
متن کاملNonlinearly Structured Low-Rank Approximation
Polynomially structured low-rank approximation problems occur in • algebraic curve fitting, e.g., conic section fitting, • subspace clustering (generalized principal component analysis), and • nonlinear and parameter-varying system identification. The maximum likelihood estimation principle applied to these nonlinear models leads to nonconvex optimization problems and yields inconsistent estima...
متن کاملSoftware for weighted structured low-rank approximation
A software package is presented that computes locally optimal solutions to low-rank approximation problems with the following features: • mosaic Hankel structure constraint on the approximating matrix, • weighted 2-norm approximation criterion, • fixed elements in the approximating matrix, • missing elements in the data matrix, and • linear constraints on an approximating matrix’s left kernel b...
متن کاملGlobal optimization for structured low rank approximation
In this paper, we investigate the complexity of the numerical construction of the Hankel structured low-rank approximation (HSLRA) problem, and develop a family of algorithms to solve this problem. Briefly, HSLRA is the problem of finding the closest (in some pre-defined norm) rank r approximation of a given Hankel matrix, which is also of Hankel structure. Unlike many other methods described i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2015
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-015-9256-x